Condor and Preemptive Resume Scheduling
نویسندگان
چکیده
Condor is a batch job system that, unlike many other scheduling systems, allows users to access both dedicated computers and computers that are not always available, perhaps because they are used as desktop computers or are not under local control. This introduces a number of problems, some of which are solved by Condor’s preemptive resume scheduling, which is the focus of this paper. Preemptive resume scheduling allows jobs to be interrupted while running, and then restarted later. Condor uses preemption in several ways in order to implement the policies supplied by users, computer owners, and system administrators.
منابع مشابه
Uncertain Resource Availabilities: Proactive and Reactive Procedures for Preemptive Resource Constrained project Scheduling Problem
Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has...
متن کاملPerformance analysis of a GI-Geo-1 buffer with a preemptive resume priority scheduling discipline
In this paper, we analyze a discrete-time GI-Geo-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. Moments and (approximate) tail probabilities of system content...
متن کاملAnalysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preemptive resume priority over customers of the other. Both classes contain customers with generally distributed service times. We show that the use of probability generating functions is beneficial for analyzing the system ...
متن کاملA Packet Switch with a Priority Scheduling Discipline: Performance Analysis
In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show th...
متن کامل- 1 - A MEAN VALUE ANALYSIS OF A CLOSED CP - TERMINAL SYSTEM WITH PREEMPTIVE RESUME PRIORITIES AND GENERAL SERVICE TIME DISTRIBUTIONS Jan
This paper deals with the analysis of a queueing system which may be used as a model for a computer system with terminals, the so-called CP-terminal system, or a machine-interference model. The system can be viewed as a single server queue with a number of finite Poisson sources, general service time distributions and a preemptive resume priority scheduling. A recursive scheme will be derived f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003